Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines
نویسندگان
چکیده
Generalized Turing machines (GTMs) are a variant of non-halting Turing machines, by computational power similar to machines with the oracle for the halting problem. GTMs allow a definition of a kind of descriptive (Kolmogorov) complexity that is uniform for finite and infinite sequences. There are several natural modifications of the definition (as there are several monotone complexities). This paper studies these definitions and compares complexities defined with the help of GTMs and complexities defined with the help of oracle machines.
منابع مشابه
Prefix-Like Complexities and Computability in the Limit
Computability in the limit represents the non-plus-ultra of constructive describability. It is well known that the limit computable functions on naturals are exactly those computable with the oracle for the halting problem. However, prefix (Kolmogorov) complexities defined with respect to these two models may differ. We introduce and compare several natural variations of prefix complexity defin...
متن کاملRamdom Reals and Possibly Infinite Computations. Part I: Randomness in ∅′ Verónica Becher and Serge Grigorieff
Using possibly infinite computations on universal monotone Turing machines, we prove Martin-Löf randomness in ∅′ of the probability that the output be in some set O ⊆ 2≤ω under complexity assumptions about O. §1. Randomness in the spirit of Rice’s theorem for computability. Let 2∗ be the set of all finite strings in the binary alphabet 2 = {0, 1}. Let 2ω be the set of all infinite binary sequen...
متن کاملTruth and Light: Physical Algorithmic Randomness
This thesis examines some problems related to Chaitin’s Ω number. In the first section, we describe several new minimalist prefix-free machines suitable for the study of concrete algorithmic information theory; the halting probabilities of these machines are all Ω numbers. In the second part, we show that when such a sequence is the result given by a measurement of a system, the system itself c...
متن کاملFinite-State Complexity and Randomness
In this paper we develop a version of Algorithmic Information Theory (AIT) by replacing Turing machines with finite transducers; the complexity induced is called finite-state complexity. In spite of the fact that the Universality Theorem (true for Turing machines) is false for finite transducers, we show that the set of finite transducers can be enumerated by a prefix-free regular set, and, as ...
متن کاملTuring machines on represented sets, a model of computation for Analysis
We introduce a new type of generalized Turing machines (GTMs), which is intended as a tool for the mathematician who studies computability in Analysis. In a single tape cell a GTM can store a symbol, a real number, a continuous real function or a probability measure, for example. The model is based on TTE, the representation approach for computable analysis. As a main result we prove that the f...
متن کامل